FDL - Step of Proof: absval_lbound

Step of Proof: absval_lbound

Inference at *
Iof proof for Lemma absval lbound:

i:

, n:

. (|i| > n)

((i < (-n))

(i > n))

by ((UnivCD)

CollapseTHENA ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n

C)) (first_tok :t) inil_term)))

C1:

C1: 1. i :

C1: 2. n :

C1:

(|i| > n)

((i < (-n))

(i > n))

C.

Definitions t T, x:A. B(x)

Lemmas nat wf